Stabbing Information of a Simple Polygon
نویسندگان
چکیده
منابع مشابه
Zero-Parity Stabbing Information
Everett et al. [EHN96, EHN97] introduced several varieties of stabbing information for the lines determined by pairs of vertices of a simple polygon P , and established their relationships to vertex visibility and other combinatorial data. In the same spirit, we define the “zero-parity (ZP) stabbing information” to be a natural weakening of their “weak stabbing information,” retaining only the ...
متن کاملNew Results on Stabbing Segments with a Polygon
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element of S. Given a segment set S, we study the problem of finding a simple polygon P stabbing S in a way that some measure of P (such as area or pe...
متن کاملA 3-Approximation Algorithm for Computing Partitions with Minimum Stabbing number of Rectilinear Simple Polygons
Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel segment inside P . We present a 3-approximation algorithm for finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms.
متن کاملComputing Triangulations with Minimum Stabbing Number
For a given point set P or a polygon P , we consider the problem of finding a triangulation T with minimum stabbing number, i.e., a triangulation such that the maximal number of segments hit by any ray going through T is minimized. We prove that this problem is NP-hard; this differs from the problem of triangulating a polygon with minimum edge weight, which is solvable in polynomial time with a...
متن کاملApproximating Polygons and Subdivisions with Minimum Link Paths
A linear time algorithm for minimum link paths inside a simple polygon. Algorithms for the reduction of the number of points required to represent a line or its caricature. Computing the visibility polygon from a convex set and related problems. implementation of the Douglas-Peucker line simpli-cation algorithm using at most cn log n operations. In preparation, 1991. 16] H. Imai and M. Iri. Com...
متن کامل